Sometimes Travelling is Easy: The Master Tour Problem
نویسندگان
چکیده
منابع مشابه
Sometimes Travelling is Easy: The Master Tour Problem
In 1975, Kalmanson proved that if the distance matrix in the travelling salesman problem (TSP) fulfills certain combinatorial conditions (that are nowadays called the Kalmanson conditions) then the TSP is solvable in polynomial time [Canad. J. Math., 27 (1995), pp. 1000– 1010]. We deal with the problem of deciding, for a given instance of the TSP, whether there is a renumbering of the cities su...
متن کامل2048 is (PSPACE) Hard, but Sometimes Easy
We prove that a variant of 2048, a popular online puzzle game, is PSPACE-Complete. Our hardness result holds for a version of the problem where the player has oracle access to the computer player’s moves. Specifically, we show that for an n × n game board G, computing a sequence of moves to reach a particular configuration C from an initial configuration C0 is PSPACE-Complete. Our reduction is ...
متن کاملNavigation in Hypertext Is Easy Only Sometimes
One of the main unsolved problems confronting Hypertext is the navigation problem namely the problem of having to know where you are in the database graph representing the structure of a Hypertext database and knowing how to get to some other place you are searching for in the database graph In order to tackle this problem we introduce a formal model for Hypertext In this model a Hypertext data...
متن کاملOptimierung Und Kontrolle Projektbereich Diskrete Optimierung Three Easy Special Cases of the Euclidean Travelling Salesman Problem Three Easy Special Cases of the Euclidean Travelling Salesman Problem
It is known that in case the distance matrix in the Travelling Salesman Problem (TSP) fulllls certain combinatorial conditions (e.g. the Demidenko conditions , the Kalmanson conditions or the Supnick conditions) then the TSP is solvable in polynomial time. This paper deals with the problem of recognizing Euclidean instances of the TSP for which there is a renumbering of the cities such that the...
متن کاملEasy Problems are Sometimes Hard
We present a detailed experimental investigation of the easy-hard-easy phase transition for randomly generated instances of satisfiability problems. Problems in the hard part of the phase transition have been extensively used for benchmarking satisfiability algorithms. This study demonstrates that problem classes and regions of the phase transition previously thought to be easy can sometimes be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 1998
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480195281878